A Question/Answer Explanation for Text Expansion
نویسنده
چکیده
1 Presentation I present in this paper the related work to my PhD thesis. It deals with an explanation approach for the generation of extended versions of text. The explanation is considered in the sense that an expansion is intended to make what is evoked into the text version understood. In order to give an account of this aspect, we resort to the notion of text questionnability deened by Virbel (1996), while exploiting the question/answer structure (Nespoulous and Virbel, 1991). The appropriate framework for the representation of the question/answer structure is that proposed by Harris (1968) which allows to represent a text in terms of syntactic and semantic structure knowledges, and linguistic operators associated to the sentence structures. We proceed by decomposition of a text into a set elementary sentences, each step of this process allows to obtain a natural sentence, and a set of transformation operators which allows to reconstitute the complex sentence from the elementary sentences. The question/answer structure, within this scope, consists in a set of links among the elementary sentences stemming from the text decomposition. These links are question/answer relations such as how ?, when ?, where ? and why ? This structure describes the elementary sentence meaning which depends on the text. These semantic links among the elementary sentences characterize the events and states corresponding to the elementary sentences in terms of manner and instrument, temporals links, localization, reason, causality and purpose. From this basis, and be inspired on the one hand by the notion of text of several structures, and on the other hand by the prediction that says that every text have a kernel version which constitutes its synopsis, we make use of the sentence expansion principle into a text, bringing the distinction between the diierent versions of the same text. 2 Harris's operator system overview (Harris, 1968) formulates in terms of mathematical system all the necessary and suucient properties and relations of natural language. He proves that the sentences have, except some degeneracy cases, the property to be decomposable into elementary sentences (K), in a one-to-one relation ; inversely there is a recursive process which allows to produce the complex sentences from this set of assertions and with the help of transformation operators ((). He analyzes the expressions of the English language in terms of sentence structures and the system that he obtains, consists in a primitive argument family and ve nite-family …
منابع مشابه
Text Expansion a Question/answer Explanation Based Approach 2 the Text Representation 2.1 Harris's Operator System Overview
1 Presentation I present in this paper the related work to my PhD thesis. It deals with an explanation approach for the generation of extended versions of text. The explanation is considered in the sense that an expansion is intended to make what is evoked into the text version understood. In order to give an account of this aspect, we resort to the notion of text questionnability deened by Vir...
متن کاملA Question/answer Explanation Based Approach for Scalable Text Expansion Vs Summarization
In this paper, we propose a text representation and a planning technique, on which can be based the generation of diierent versions of a same text. We fo-cused our study on narration of events and states. This kind of text can be related in its minimal version, that we call kernel version, or by a hierarchy of versions containing more and more details, until the longest version that includes al...
متن کاملA Question/answer Explanation Based Approach for Customizable Text Expansion Vs Summarization
In this paper, we propose a text representation and a planning technique, on which can be based the generation of diierent versions of a same text. We focused our study on narration of events and states. This kind of text can be related in its minimal version, that we call kernel version, or by a hierarchy of versions containing more and more details, until the longest version that includes all...
متن کاملA Data Driven Approach to Query Expansion in Question Answering
Automated answering of natural language questions is an interesting and useful problem to solve. Question answering (QA) systems often perform information retrieval at an initial stage. Information retrieval (IR) performance, provided by engines such as Lucene, places a bound on overall system performance. For example, no answer bearing documents are retrieved at low ranks for almost 40% of que...
متن کاملارایه یک پیکره پرسش و پاسخ مذهبی در زبان فارسی
Question answering system is a field in natural language processing and information retrieval noticed by researchers in these decades. Due to a growing interest in this field of research, the need to have appropriate data sources is perceived. Most researches about developing question answering corpus area have been done in English so far, but in other languages as Persian, the lack of these co...
متن کامل